On Scattered Convex Geometries

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic values on convex geometries

A game on a convex geometry is a real-valued function defined on the family L of the closed sets of a closure operator which satisfies the finite Minkowski-KreinMilman property. If L is the Boolean algebra 2 then we obtain an n-person cooperative game. We will extend the work of Weber on probabilistic values to games on convex geometries. As a result, we obtain a family of axioms that give rise...

متن کامل

Convex Preserving Scattered Data

We use bivariate C 1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and suucient condition on Bernstein-B ezier polynomials, we set the convexity preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on t...

متن کامل

Clustering on antimatroids and convex geometries

The clustering problem as a problem of set function optimization with constraints is considered. The behavior of quasi-concave functions on antimatroids and on convex geometries is investigated. The duality of these two set function optimizations is proved. The greedy type Chain algorithm, which allows to find an optimal cluster, both as the “most distant” group on antimatroids and as a dense c...

متن کامل

Marginal operators for games on convex geometries

We introduce marginal worth vectors and quasi-supermodular games on convex geometries. Furthermore, we study some properties of the minimal marginal operator and the maximal marginal operator on the space of the games on convex geometries. 1991 Mathematics Subject Classi...cation: 90D12

متن کامل

The Shapley value on convex geometries

A game on a convex geometry is a real-valued function de0ned on the family L of the closed sets of a closure operator which satis0es the 0nite Minkowski–Krein–Milman property. If L is the boolean algebra 2 then we obtain an n-person cooperative game. Faigle and Kern investigated games where L is the distributive lattice of the order ideals of the poset of players. We obtain two classes of axiom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Order

سال: 2016

ISSN: 0167-8094,1572-9273

DOI: 10.1007/s11083-016-9413-0